/**
 * @author ghp
 * @date 2023/6/17
 * @title
 * @description
 */
public class Main {
    public static void main(String[] args) {
        Solution solution = new Solution();
//        TreeNode node1 = new TreeNode(1);
//        TreeNode node2 = new TreeNode(2);
//        TreeNode node3 = new TreeNode(3);
//        TreeNode node4 = new TreeNode(4);
//        TreeNode node5 = new TreeNode(5);
//        TreeNode node6 = new TreeNode(6);
//
//        node2.left = node3;
//        node2.right = node4;
//
//        node5.right = node6;
//
//        node1.left = node2;
//        node1.right = node5;

//        solution.maxSlidingWindow(new int[]{1,2,7,5,4,8}, 3);
        boolean b = solution.searchMatrix(new int[][]{
                {1, 4, 7, 11, 15}, {2, 5, 8, 12, 19}, {3, 6, 9, 16, 22}, {10, 13, 14, 17, 24}, {18, 21, 23, 26, 30}
        }, 5);
        System.out.println("b = " + b);
    }
}
